Achieving 100% throughput in an input-queued switch
نویسندگان
چکیده
منابع مشابه
Achieving 100% Throughput in an Input-Queued Switch
Abstract — It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However, it has not been previously shown that if a suitable queueing policy and sche...
متن کاملScheduling of an Input-queued Switch to Achieve Maximal Throughput
Achieving high throughput in input-queued switches has been found to be difficult, especially when traffic is nonuniform in the sense that different inputs have very different cell generation rates+ We show that for general arrival processes, 100% throughput can be achieved with a simple algorithm that is very easy to implement+ We consider a switch in which in each time slot, at most one cell ...
متن کاملPrioritized Arbitration for Input-queued Switches with 100% Throughput
Input buffered switches are known to suffer from head-of-line (HOL) blocking that limits the throughput to approximately 58.6%. It has been shown that 100% throughput can be achieved with virtual output queueing (VOQ) and an arbitration algorithm that controls the access to the switch fabric in each time slot. No weight-dependent algorithm was known that supports priorities, which are necessary...
متن کاملThroughput Analysis of the Bifurcated Input-Queued ATM Switch
In this paper there suggested is a bifurcated (or multiple) input-queued ATM switch in which a buffer for each input port is divided into multiple (m) buffer blocks, i.e., bifurcated buffers, for enhancement of the limited throughput of the ordinary input-queued switch using a single FIFO. As the contention/arbitration rule for the bifurcated input-queued switching scheme, free and restricted c...
متن کاملScheduling Multicast Cells in an Input-Queued Switch
In this paper we consider policies for scheduling cells in an input-queued multicast switch. It is assumed that each input maintains a single queue for arriving multicast cells and that only the cell at the head of line (HOL) can be observed and scheduled at one time. The policies are assumed to be work-conserving,which means that cells may be copied to the outputs that they request over severa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1999
ISSN: 0090-6778
DOI: 10.1109/26.780463